Robust burst detection and acquisition system and method

ABSTRACT

A method of parameter estimation in a shared channel communications system includes the steps of receiving a preamble including a first sequence corresponding to a sequence having zero autocorrelation, a second sequence having zero autocorrelation, and a third sequence having zero autocorrelation, performing a coarse carrier frequency estimate based on the first sequence, and performing a fine carrier frequency estimate based on the second and third sequences.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims priority to U.S. Provisional Patent Application No. 60/296,450, filed on Jun. 8, 2001, entitled “ROBUST BURST DETECTION ACQUISITION SYSTEM AND METHOD,” to U.S. Provisional Patent Application No. 60,296,455, filed on Jun. 8, 2001, entitled “RECEIVER HAVING INTEGRATED SPECTRAL ANALYSIS CAPABILITY,” and is related to U.S. patent application Ser. No. _______, filed on Jun. 7, 2002, entitled “RECEIVER HAVING INTEGRATED SPECTRAL ANALYSIS CAPABILITY” (Attorney docket No. 1875.1480001), and U.S. patent application Ser. No. 09/430,821, filed on Oct. 29, 1999, entitled “BURST RECEIVER SYSTEM”, all of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The present invention relates to a burst demodulator for use in a high speed bidirectional digital transmission of voice, video, and data, and more particularly, to a robust TDMA burst receiver and a method for reliably detecting a preamble.

[0004] 2. Related Art

[0005] Modem two-way communication for cable television, hybrid fiber/coax systems, wireless local multipoint distribution systems, and microwave multipoint distribution systems use time division multiple access (TDMA) to carry short burst transmissions in an upstream direction (return path) from multiple subscribers to a headend receiver. FIG. 1 shows an example of a TDMA time slot. In general the return path transmission characteristics, power level, and the clock offset from each subscriber will be different, thereby requiring the headend receiver to re-synchronize to each of the TDMA bursts. In order to minimize overhead time, it is desirable that the TDMA burst receiver be capable of reliably recognizing and synchronizing the preamble in as short a time as possible.

[0006] Existing TDMA burst receivers recognize and synchronize to a TDMA burst by correlating a preamble received at the beginning of the burst to an internal representation of the preamble stored in the TDMA burst receiver. A complication in the recognition and synchronization of the preamble is that a high power level of the TDMA burst transmission may cause the TDMA receiver to mistake a sidelobe peak of the autocorrelation of the preamble for the main peak.

[0007] A further complication is that message data from the subscriber may have the same or nearly the same symbol pattern as the preamble. Yet a further complication is that narrowband noise or ingress may partially mask or emulate the TDMA burst transmission or be so large that its correlation to the preamble is as great as the main peak. A traditional solution to these complexities is to use a long preamble sequence of a few hundred symbols or more. However, such a long preamble sequence increases the time overhead of a system and is uneconomical for a system having data messages of less than a few thousand symbols.

[0008] Robust burst detection of high-order constellation modulation formats (e.g., 256-QAM), in presence of large carrier frequency offset, large dynamic range, and severe channel impairments such as narrow-band interferers, poses serious challenges. A typical burst receiver may only deal with a subset of these issues.

[0009] Accordingly, a need exists for robust burst detection using only minimum number of preamble symbols.

SUMMARY OF THE INVENTION

[0010] The present invention is directed to a robust burst detection and acquisition method and system in a burst communication system that substantially obviates one or more of the problems and disadvantages of the related art.

[0011] One advantage of the present invention is being able to utilize relatively short preamble sequences for burst parameter estimation.

[0012] Another advantage of the present invention is being able to use higher order QAM modulation schemes.

[0013] Additional features and advantages of the invention will be set forth in the description which follows, and in part will be apparent from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

[0014] To achieve these and other advantages and in accordance with the purpose of the present invention, as embodied and broadly described, there is provided a method of parameter estimation in a shared channel communications system comprising the steps of receiving a preamble comprising first, second and third sequences corresponding to sequences having zero autocorrelation, performing a coarse carrier frequency estimate based on the first sequence, and performing a fine carrier frequency estimate based on the second and third sequences.

[0015] In another aspect of the present invention there is provided a method of ranging in a shared channel communications system comprising the steps of receiving a ranging preamble comprising a first near-CAZAC sequence followed by second and third sequences whose derivatives correspond to CAZAC sequences, performing a coarse carrier frequency estimate based on the first sequence, and performing a fine carrier frequency estimate based on the second and third sequences.

[0016] In another aspect of the present invention there is provided a method of tracking data in a shared channel communications system comprising the steps of receiving a ranging preamble, performing a coarse carrier frequency estimate based on the ranging preamble, performing a fine carrier frequency estimate based on the ranging preamble, estimating gain based on the fine carrier frequency estimate, receiving a burst including a burst preamble and data, and correcting the gain based on tracking the data.

[0017] In another aspect of the present invention there is provided a method of receiving data in a shared channel communications system including the steps of receiving a burst including a preamble and data, performing a carrier frequency estimate and a gain estimate based on the preamble, tracking the burst with an equalizer, adjusting the gain estimate based on at least a main tap coefficient of the equalizer, wherein the equalizer uses at least a portion of the data to derive the main tap coefficient, and extracting symbols from the data.

[0018] In another aspect of the present invention there is provided a system for ranging a receiver in a shared communications channel comprising a filter that receives a signal from the shared communications channel, the signal including a ranging preamble that has a first sequence whose derivative is a zero autocorrelation sequence, and second and third sequences corresponding to a truncated first sequence, and outputs Nyquist samples, a preamble processor/ranging subsystem that receives the Nyquist samples from the filter, provides a coarse carrier frequency estimate based on the first sequence, and refines the coarse carrier frequency estimate based on the second and third sequences to provide a fine carrier frequency estimate, and a tracking subsystem that extracts data from the signal based on the fine carrier frequency estimate from the preamble processor/ranging system.

[0019] In another aspect of the present invention there is provided a system for parameter estimation in a shared channel communications system comprising means for receiving a preamble comprising a first sequence corresponding to a sequence having zero autocorrelation, and second and third sequences corresponding to a truncated first sequence, means for performing a coarse carrier frequency estimate based on the first sequence, and means for performing a fine carrier frequency estimate based on the second and third sequences.

[0020] It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are intended to provide further explanation of the invention as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention. In the drawings:

[0022]FIG. 1 illustrates a typical TDMA time slot;

[0023]FIG. 2 is a block diagram of an exemplary cable-based communications system;

[0024]FIG. 3 is a diagram illustrating the head end architecture at a cable modem termination system (CMTS);

[0025]FIG. 4 further illustrates the relationship between components at a head end of a cable modem termination system (CMTS) of FIG. 2;

[0026]FIG. 5 illustrates a burst as a function of time;

[0027]FIG. 6 is a block diagram illustrating a burst receiver of one embodiment of the present invention;

[0028]FIG. 7 is a generalized block diagram illustrating reception of a signal including ingress noise;

[0029]FIG. 8 is a generalized block diagram illustrating reception of a signal and its filtering;

[0030]FIG. 9 illustrates an embodiment of the present invention in block diagram form;

[0031]FIG. 10 shows a structure of the preamble correlator of one embodiment of the present invention;

[0032]FIG. 11 illustrates a direct correlation vector using a CAZAC sequence;

[0033]FIG. 12 illustrates a differential correlation vector using a CAZAC sequence;

[0034]FIG. 13 illustrates a correlation vector for a preamble with four CAZAC-type sequences; and

[0035]FIG. 14 illustrates a look up table for gain correction used in an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0036] Reference will now be made in detail to the embodiments of the present invention, examples of which are illustrated in the accompanying drawings.

[0037] This invention relates to a communication system where many users are shared. In one embodiment, it relates to a time division multiple access (TDMA) communication system. In a TDMA system such as a DOCSIS (Data-Over-Cable Service Interface Specifications) based cable network in the upstream communication, one needs a burst receiver which can detect packets from different subscribers. It will be appreciated that the invention is also applicable to other modulation schemes, such as FDMA, CDMA or SCDMA, although the description that follows is primarily done in terms of TDMA.

[0038] Typical thermal noise, as well as other factors result in detector and symbol processor imperfections. If the only inaccuracies present in the system were due to thermal noise, the signal-to-noise ratio of such a system would be approximately 30 dB which would allow the use of 256-QAM modulation. However, practical systems normally operate at much lower order QAM, for example 16-QAM, due to an inability to accurately estimate the relevant parameters. The parameters of primary interest are carrier frequency, carrier phase, gain, and symbol timing. Taking a real 16-QAM system as an example, carrier phase may be approximately 20 MHz. Carrier phase error of 5 degrees would be noticeable for 16-QAM modulation. ¼ dB to ½ dB gain error is noticeable for 16-QAM, as would 5 -10% error of a symbol timing window. With regard to symbol rate, for 5.12 mega-symbols per second, a 1% error rate corresponds to 50 KHz. Thus, if carrier frequency is off by 50 KHz, the receiver will begin to have problems distinguishing the symbols. Thus, any mechanism that allows for a more precise estimation of parameters allows for a system that performs much closer to the theoretical limit, allowing in turn an increase in data rate transmission.

[0039] Autocorrelation is a measure of the randomness of a signal. A CAZAC (constant amplitude zero autocorrelation) sequence has a frequency spectrum comprised of constant-amplitude components that extends over the entire bandwidth of the transmission channel. A large body of literature is generally available on the subject of CAZAC sequences. For background, the reader is generally referred to, for example, U.S. Pat. No. 4,089,061, as well as to standard texts on digital communications and signal processing. Below is a brief summary of CAZAC sequence properties and derivation.

[0040] CAZAC sequences may be derived from binary pseudo-random sequences exhibiting a property P1.

[0041] {a_(i)} will designate a binary pseudo-random sequence of period or length L: {a_(i)}={a_(L)}=a₀a₁a₂ . . . a_(L−1), where the elements a₁ are equal to ±1. The autocorrelation matrix of this sequence is: $\quad\begin{bmatrix} A_{0} & A_{1} & \ldots & A_{L - 1} \\ A_{1} & A_{0} & \ldots & A_{L - 2} \\ \vdots & \quad & \quad & \quad \\ A_{L - 1} & \quad & \ldots & A_{0} \end{bmatrix}$

[0042] where A_(g) is the g^(th) coefficient of the periodic autocorrelation function: $A_{g} = {\sum\limits_{i = 0}^{L - 1}\quad {a_{i}a_{i + g}}}$

[0043] for g=0, 1, . . . (L−1).

[0044] All sequences {a_(i)} such that A₀=L and A_(g)=1 for g=1, . . . , (L−1) are said to have the property P1. The binary pseudo-random sequences that are known as maximum length binary pseudo-random sequences exhibit property P1.

[0045] For example, for L=15, one obtains the sequence:

0 0 0 1 0 0 1 1 0 1 0 1 1 1 1  (1)

[0046] Replacing each 0 by −1, one obtains a sequence which exhibits property P1:

−1 −1 −1 1 −1 −1 1 1 −1 1 −1 1 1 1 1  (2)

[0047] Another family of periodic binary pseudo-random sequences exhibiting property P1 comprises all sequences whose elements are determined by the quadratic and non-quadratic residues of prime numbers of the 4K−1 form. These sequences have a length L defined as L=4K−1 where L is a prime number and K a positive integer. For example, for L=11, the following sequence is obtained:

1 1 −1 1 1 1 −1 −1 −1 1 −1  (3)

[0048] The CAZAC sequences may be obtained by adding an imaginary constant jα to each of the elements a₁ of the sequences which have the property P1. This constant is defined as $\begin{matrix} {\alpha = {\pm \frac{1}{\sqrt{L}}}} & (4) \end{matrix}$

[0049] For example, in the case of sequence (2) of length L=15, α=±0.2582. If a value of α=±0.2582 is selected, sequence (2) becomes:

−1+0.2582j; −1+0.2582j; −1+0.2582j; +1+0.2582j; −1+0.2582j; −1+0.2582j;+1+0.2582j; +1+0.2582j; −1+0.2582j; +1+0.2582j; −1+0.2582j; +1+0.2582j; +1+0.2582j; +1+0.2582j; +1+0.2582j.(j={square root}−1).

[0050] The sequence thus obtained will be designated {u₁} hereafter. The autocorrelation matrix of these sequences is: $U = \begin{bmatrix} U_{0} & U_{1} & U_{2} & \ldots & U_{L - 1} \\ U_{1} & U_{0} & \quad & \quad & U_{L - 2} \\ U_{2} & U_{1} & U_{0} & \quad & \quad \\ U_{L - 1} & \quad & \ldots & \quad & U_{0} \end{bmatrix}$

[0051] where U_(g) is the g^(th) coefficient of the periodic autocorrelation function $U_{g} = {\sum\limits_{i = 0}^{L - 1}\quad {u_{i}u_{i + g}^{*}}}$

[0052] for g=0, 1, . . . ,(L−1), and u_(i) ^(*)+g * is the complex conjugate of u_(1+g).

[0053] All sequences {u₁} have the following property P2:

U ₀≠0 and U _(g)=0 for g=1, . . . , (L−1).

[0054] Subsequently, it will further be assumed that U₀=L which can be obtained conventionally by dividing each element of sequence {u_(i)} by a suitable factor.

[0055] If the transmitted training sequences {u₁} have the following property P3:

U ₀ =L and U _(g)=0 for g=1, . . . ,(L−1).

[0056] Such a sequence, which has an autocorrelation function all the coefficients of which except the first, U₀, are zero and all of elements are complex numbers having a constant amplitude, is also a CAZAC sequence.

[0057] Another family of CAZAC sequences, as defined above, is comprised of sequences {u₁} of length L=K² defined as u₁=W^(βγ), where

[0058] β, γ=0, 1, . . . ,(K−1)

[0059] i=Kβ+γ=0, 1, . . . ,(L−1), and p1 W is a primitive K^(th) root of unity, e.g., W=exp (2π/K).

[0060] The sequence can be obtained by using the elements in the successive rows of the matrix (W^(βγ)).

[0061] For example, for K=4, L=16, and W=exp (jπ/2), the matrix (W^(βγ)) is written $W^{\beta\gamma} = \begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & j & {- 1} & {- j} \\ 1 & {- 1} & 1 & {- 1} \\ 1 & {- j} & {- 1} & j \end{bmatrix}$

[0062] The following sequence is obtained:

1 1 1 1 1 j −1 1 1 −j 1 −1 1 −1 1 −j −1 j

[0063] It should be noted that the elements of this sequence have a constant amplitude equal to 1 and can have four different phases.

[0064] Another family of CAZAC sequences is comprised of all sequences {u_(i)} of length L=odd integer, defined as

u_(i) =W ^(i) ²

[0065] where i=0, . . . ,(L−1), and W is a primitive L^(th) root of unity.

[0066] For example, with L=3 and W=exp (j2π/3), the following sequence is obtained:

1, cos 2π/3+j sin 2π/3, cos 2π/3+j sin 2π/3.

[0067] Another family of CAZAC sequences comprises the sequences {U_(L)} of length L=m^(2K)+1 defined as u_(i)=a_(β) (modulo m) W^(βγ), where

[0068] {a_(m)} is a CAZAC sequence of length m

[0069] n=0, 1, . . . ,(m−1)

[0070] β=0, 1, . . . ,(M−1) M=m^(K+1)

[0071] γ=0, 1, . . . ,(n−1) n=m^(K)

[0072] i=Mβ+γ, and

[0073] W is a primitive M^(th) root of unity.

[0074] The sequence can be obtained by using the various elements in the successive rows of the M×N matrix defined as (a_(β) (modulo m) ) W^(βγ). For example, for m=2 and k=1, one has L=2³=8, m=2²=4, n=2¹=2, and W=exp jπ/2=j.

[0075] If {a_(m)}=1, j is selected as a CAZAC sequence of length m=2, the following sequence results:

1 1 j −1 1 −1 j 1

[0076] A CAZAC sequence {u₁}={u_(L=4m)} of length L=4 m may be used which is derived from two CAZAC sequences {a₁} and {b₁} of length m. The sequence {u_(L=4m)} is obtained by putting

[0077] u_(2k)=a_(k) (modulo m)

[0078] u_(2k+1), =b_(k) (modulo m) W^(k)

[0079] for k=0,1, . . . ,(2m−1), where W is a primitive (2 m)^(th) root of unity.

[0080] For example, from the CAZAC sequences of length m=4, {a₁}={b₁}=1 1 1 −1, the following CAZAC sequence {u_(i)}={u₁₆} of length L=16 results:

1, 1, 1, e^(jπ)/4, 1, j, −1, −e^(3jπ)/4, 1, −1, 1, e^(5jπ)/4, 1,−j, −1, −e^(7jπ)/4.

[0081] A 4-phase CAZAC sequence {c_(n)} of length 16 symbols can be determined by

c _(4·k+l) =j ^(k·l) , j={square root}{square root over (−1)}, k=0,1,2,3, l=0,1,2,3{c _(n)}={1,1,1,1,1,j,−1,−j,1,−1,1,−1,1−j,−1,j}

[0082] A QPSK sequence corresponding to the above sequence is:

1+j, 1+j, 1+j, 1+j, 1+j, −1+j, −1−j, 1−j, 1−j, 1+j, −1−j, 1+j, −1−j, 1+j, 1−j, −1j, −1+j

[0083] For notational purposes, if c₀, c₁. . . c₁₅ refers to a CAZAC sequence {C₁₆}=0.5.* [1+j ,1+j ,−1−j ,1+j, 1+j ,−1+j ,1+j ,1−j ,1+j ,−1−j ,−1−j, −1−j ,1+j, 1−j ,1+j, −1+j] (a 16 symbol CAZAC sequence), the sequence {d₁₇}=d₁, d₂ . . . d₁₆ will refer to a sequence such that a discrete time derivative of {d₁₇}={c₁₆}, i.e., {c₆} is a derivative of {d₁₇}, where the first symbol d₀=1+j is added to the sequence to enable the differentiation to result in a 16 symbol sequence (i.e., d₀=d₁):

{d ₁₇}=0.5.* [1+j ,1+j ,1+j, −1−j ,−1−j, −1−j ,1−j ,1−j ,−1−j, −1−j, 1+j, −1−j, 1+j, 1+j , 1−j , 1−j 1+j]

[0084] A corresponding 16 symbol differential sequence {d₁₆}=0.5.* [1+j ,1+j, −1−j, −1−j, −1−j, 1−j ,1−j ,−1−j ,−1−j, 1+j, −1−j ,1+j, 1+j, 1−j, 1−j ,1+j] is a 16 symbol near {d₁₇} and CAZAC sequence (i.e., with the symbol d₀ of {d₁₇} deleted)—in other words, although {d₁₆} are not, strictly speaking, CAZAC, their properties are such that the receiver can detect it as if it were CAZAC. {d₁₆} may also be referred to as a truncated {d₁₇} sequence (in this case, truncated by one symbol).

[0085] Note also that {c₁₆} represents the changes in {d₁₇}. Conversely, again ignoring the distinction between discrete and continuous functions {c₁₆}=d{d₁₇}/dn (n being the time variable). When d₁ is unchanged in two successive symbols, c₁ is 1+j. When d₁ is inverted (180 degree change from one symbol to the next), c₁ is −1−j. When d₁ rotates 90 degrees in one direction, c₁ is 1−j. When d₁ rotates 90 degrees in the other direction, c₁ is −1+j. This means that {c₁₆} is the differential decoding of {d₁₇}—decoding {d₁₇} gives a CAZAC. Conversely, {d₁₇} is the differential encoding of {c₁₆}—encoding a CAZAC gives a near-CAZAC. Note further that a CAZAC is a special case of a zero autocorrelation sequence. Since the signals are digital, the term “derivative” or “differentiation” here is used to refer to discrete operation, rather than continuous. Similarly, {d₁₆} represents an integral of a discrete function (sequence) represented by {C₁₆}.

[0086]FIG. 2 is a block diagram of an exemplary cable based communications system 100 according to the present invention. The communications system 100 includes a master headend 102, hubs 104 a-b, nodes 106 a-d, and a plurality of subscribers 108. The subscribers 108 exchange bidirectional communications traffic with a master headend 102 through various optical and electrical media. For instance, communications traffic is passed between the master headend 102 and the hub(s) 104 through optical media, while communications traffic is passed between the nodes 106 and the subscribers 108 through electrical media. These optical and electrical media are described below.

[0087] Fiber optic backbone segments 120 a-c provide an interconnection between the master headend 102 and the hubs 104. As shown in FIG. 2, the backbone segments 120 a-c each have exemplary distances of twenty miles or less. However, distances greater than twenty miles are within the scope of the present invention.

[0088] The nodes 106 each provide an interface between optical communications media and electrical communications media. As shown in FIG. 2 the fiber optic lines 122 establish connections between the hubs 104 and the nodes 106. For example, the fiber optic line 122 d connects the hub 104 b and the node 106 d. Also, the nodes 106 are each coupled to one or more coaxial cables 124. The coaxial cables 124, in conjunction with coaxial cables 126, exchange electrical signals with the subscribers 108. For example, the coaxial cable 124 a and the coaxial cable 126 d connects the node 106 d with the subscribers 108 e and 108 f.

[0089] Traffic in the communications system 100 includes upstream traffic and downstream traffic. Downstream traffic is received by the subscribers 108 from system elements, such as the master headend 102. In contrast, upstream traffic is originated by the subscribers 108 and directed to system elements, such as the master headend 102.

[0090] For the coaxial cables 124, the upstream and downstream traffic are each allocated to a particular frequency band. For example, upstream traffic may be allocated to a 5-42 MHz frequency band, while downstream traffic may be allocated to a 54-860 MHz frequency band. One or more frequency channels exist within these frequency bands that provide for the transmission of signals. These signals are modulated according to a digital modulation scheme, such as quadrature amplitude modulation (QAM) or quadrature phase shift keying (QPSK).

[0091] Multiple subscribers 108 share the electrical and optical communications media of the communications system 100. For instance, in the context of the coaxial cables 124 and 126, the subscribers 108 transmit signals across the same frequency channel in the same coaxial cable 124. To accommodate such frequency channel sharing, the communications system 100 employs a multiple access technique, such as TDMA for upstream traffic.

[0092] TDMA is a transmission scheme that allows a number of subscribers 108 to transmit information across a single frequency channel without interference. This is enabled by allocating unique time slots to each subscriber 108. According to TDMA, the subscribers 108 send upstream transmissions across a channel during one or more time slots that occur within a TDMA frame. Various types of time slots exist. Three examples are reservation slots, contention slots, and maintenance slots.

[0093] The present invention provides a receiver having on-board spectral analysis capabilities that may be synchronized to one or more particular upstream transmissions. Accordingly, the receiver may be included in the communications system 100 elements, such as the nodes 106, the hubs 104 and/or the master headend 102. The receiver may be implemented on a chip.

[0094] Embodiments of the present invention employ techniques that digitally compute spectral information corresponding to one or more transmissions. For example, the present invention may employ Fast Fourier Transforms (FFT), filter banks, such as quadrature mirror filter banks and wavelet filter banks, and any other spectral analysis techniques that are apparent to persons skilled in the relevant art.

[0095] An embodiment of the present invention further provides an on-chip spectral analysis capability that is traditionally performed by general-purpose processors, rather than by receivers such as TDMA burst receivers. This on-chip capability advantageously provides for the performance of sophisticated spectrum management functions in a practical and economical manner. For instance, the present invention eliminates the need for external spectrum computation equipment. Furthermore, the present invention does not require special software to be written to compute the spectrum.

[0096] This spectral analysis may indicate the spectral shape of transmitted signals, including whether they meet any specified transmit spectral mask(s). In addition, this analysis reveals the presence of interfering signals, the background noise floor (including its level and shape), and the presence of partial spectral nulls in the upstream transmission signals. Such nulls indicate reflections (echoes) in the upstream path.

[0097] When operating in a TDMA environment, this spectral analysis (e.g., performing an FFT) may be synchronized to one or more TDMA slots. This permits the analysis of the spectrum of a single user transmission, and/or a class of user transmissions (e.g., for each type of TDMA slot). As a result, this spectrum analysis yields channel quality information that can be used to efficiently manage the usage of TDMA, FDMA, and TDMA/FDMA systems.

[0098] This channel quality information may include spectral measurements arranged in a plurality of bins that each correspond to a respective frequency range. These bins are each computed from the same block of transmission signal samples. Thus, the present invention eliminates the aforementioned confusion generated by swept spectrum analyzers, since no sweeping occurs.

[0099] One embodiment of the present invention provides an on-chip FFT computation capability integrated into a headend burst receiver chip. FIG. 3 further illustrates the configuration of the master head end 102 of one embodiment of the present invention. As illustrated in FIG. 3, analog inputs 220 are received by a burst receiver 202. The burst receiver 202 communicates with a MAC controller 206.

[0100] The MAC controller 206 communicates over the Ethernet 234 with a Routing/Classification Engine 233, which in turn is connected to a Wide Area Network 244 (WAN). The MAC controller 206 utilizes upstream SDRAM 236 for keys in reassembly, and further utilizes upstream SDRAM 235 for PHS output queues.

[0101] The MAC controller 206 is connected to a PCI bus 249, and through the PCI bus 249 to a System CPU 246 and a System Memory 247. The MAC controller 206 is further connected to a downstream SDRAM 248. Data flows through the downstream modulator 231, and is then output as downstream analog transmission 232.

[0102]FIG. 4 is a block diagram illustrating the spectrum management architecture of the present invention. This architecture includes the upstream burst receiver 202, a spectrum management/allocation module 204, the upstream media access controller (MAC) 206, and a management information base (MIB) 208.

[0103] The upstream burst receiver 202 receives an upstream transmission 220 from a shared communications medium 210, which may be one of several types of communications media, for example, a coaxial cable, a fiber optic transmission medium, a satellite communication system, or a wireless medium that conveys wireless radio frequency (RF) signals.

[0104] The upstream transmission 220 is a burst transmission (also referred to herein as a packet) that is transmitted by a user, such as the subscriber 108 (see FIG. 2). The upstream burst receiver 202 acquires the timing of packet 220 and decodes it according to an error correction coding scheme (e.g., Reed Solomon), and obtains the payload (i.e., user data) from each packet 220. An example of a packet waveform is illustrated in FIG. 5.

[0105] The upstream burst receiver 202 passes some of the recovered information to the MAC controller 206. For example, some burst transmissions from users are requests for bandwidth allocation. The MAC controller 206 receives such requests and, in response, allocates upstream communications capacity to satisfy such requests. In addition, the upstream burst receiver 202 transfers traffic performance statistics to the MAC controller 206. Examples of these statistics include packet error rates (PER) and signal to noise (SNR) ratios.

[0106] The spectrum management/allocation module 204 receives information from the upstream burst receiver 202, the MAC controller 206 and the MIB 208.

[0107] From this information, the spectrum management/allocation module 204 generates upstream channel frequency assignments, which are sent to the upstream burst receiver 202. These assignments instruct the upstream burst receiver 202 to operate within certain portions of the upstream RF spectrum. In addition, the spectrum management/allocation module 204 generates an upstream channel allocation message that is sent to the subscribers 108. This message directs the subscribers 108 to operate within certain portions of the RF spectrum.

[0108] The spectrum management/allocation module 204 receives a channel quality message 226 from the MAC controller 206. This message includes information such as packet error rates (PER), and packet SNR.

[0109] The spectrum management/allocation module 204 receives an FFT message 222 from the upstream burst receiver 202. In addition, the spectrum management/allocation module 204 receives a channel SNR (channel noise power) message 224 from the upstream burst receiver 202.

[0110] The spectrum management/allocation module 204 receives a spectrum availability message 230 from the MIB 208. The spectrum management/allocation module 204 processes these received messages and, in response, generates a spectrum allocation plan. The spectrum allocation plan designates which portions of the spectrum are used by which subscriber to transfer information across the shared communications medium 210. In addition, this plan specifies the characteristics of individual signals transmitted across these spectral portions. For example, the plan may specify transmit powers, data rates, and spacing between frequency channels in an FDMA environment.

[0111] As further shown in FIG. 6, the embodiment includes an advanced dual-channel cable network receiver which accepts upstream burst data in a frequency-agile, time-division multiple access (TDMA) scheme (only one channel is shown in the figure for clarity). The architecture of the burst receiver 202 in an embodiment includes an FFT processor 250. The burst receiver 202 further includes an analog front end (AFE) 251 (including a multiplexer), which forwards the received data into a digital complex mixer 252 IP. The burst receiver 202 can decode signal formats from BPSK up to 256-QAM.

[0112] The analog front-end (AFE) 251, a QAM demodulator 257 and an FEC (forward error correction) decoder 263 are integrated for each channel. The AFE 251 performs A-to-D conversion on either an IF input, an RF input, or baseband I/Q inputs. A multiplexing logic may be also included to share the same ADC output between two receive channels or to receive digital samples from an external ADC. The multiplexing logic can receive external ADC outputs at much higher sampling rates to perform direct RF sampling. The multiplexing logic allows the receiving two frequency channels from the same cable network, or process inputs from two separate cable networks.

[0113] A digital quadrature down-mixer 252 translates an input spectral center to true DC. The mixer 252 is used to move the quantize IF samples to true DC, for example, using quadrature carriers generated from a programmable direct digital frequency synthesizer (DDFS) 273. The digital down-mixer 252 then translates the desired channel down to DC.

[0114] The I and Q samples pass through decimators 253, 254 and square-root raised cosine filters 255, 256 with an excess bandwidth α=0.25. The over-sampled I and Q signals from the digital down-mixer 252 pass through dual decimators 253,254 that are programmed based on the expected symbol rate. The decimated samples pass through dual square-root Nyquist filters 255, 256 with an excess bandwidth α=0.25 to match the pulse-shaping filters on transmitter side.

[0115] Fast burst detection and acquisition are performed on the preamble with programmable length and pattern. The fast acquisition for carrier phase and symbol timing is performed on preamble symbols. Each received TDMA burst contains a PHY overhead which includes a preamble using QPSK-like signaling, no matter what is the actual modulation format for the payload. Since the four-fold ambiguity of the carrier phase can be resolved by matching the preamble pattern, there is no need for differential coding which degrades the effective FEC performance. Depending on the payload modulation format, the burst receiver 202 may acquire burst synchronization on a short preamble, even if the burst-to-burst power variation is over 20 dB. An option of processing a BPSK preamble is also preferably provided.

[0116] An adaptive equalizer 258 characterizes the RF channel response and removes inter-symbol interference (ISI) caused by micro-reflections. An equalizer is needed at high symbol rates, especially for high modulation level (beyond QPSK), to mitigate channel impairments due to micro-reflections. The embodiment implements a 24-tap complex linear (feed-forward) equalizer. During initialization, the equalizer 258 adapts to each subscriber channel and sends its coefficients to the MAC controller 206. The MAC controller 206 sends the information back to the individual subscriber 108 via the downstream path 232 to program the transmitter's pre-equalizer. This scheme avoids the need for long preambles for future incoming bursts from the same subscriber 108, and improves the overall efficiency of bandwidth usage.

[0117] An ingress-cancelling processor 258 suppresses narrow-band noise and/or adjacent-channel interference (ACI). The Forward Error Correction (FEC) decoder 263 performs deinterleaving, descrambling and RS decoding with flexible parameters. The recovered data stream is delivered and burst receiver 202 control inputs are accepted through a MAC/PHY receive interface 265 linked to a MAC controller 206. The embodiment can interface with the MAC controller 206 with serial bit transfer, and also supports an advanced MAC/PHY interface for higher data rates. An on-chip FFT processor can analyze an RF spectrum with a selectable bandwidth and length.

[0118] The ingress cancelling logic analyzes the noise environment of the desired upstream channel. The ingress cancelling logic then suppresses narrow-band ingress and/or adjacent-channel interference appearing in the desired upstream channel to maximize the usage of the entire upstream band.

[0119] The upstream transmitter (user) 108 scrambles the data stream to ensure adequate symbol transitions for symbol timing recovery in the burst receiver 202. A descrambler 272 recovers the raw data stream and is reinitialized on each burst. The generator polymial and initial seed are both programmable up to 23 bits.

[0120] The upstream transmitter 108 performs data interleaving within each burst in a byte format. The interleaving type is block interleaving with variable block size and interleaving depth depending on the burst type. Thus, the deinterleaver 262 supports real-time changes on the interleaving block size and depth. In a dynamic mode, the deinterleaving block size can be adjusted within one burst to avoid leaving a small fraction for the last interleaving block.

[0121] The Reed-Solomon decoder 264 is over GF(256) and is programmable to correct errors from 1 to 16 bytes within an FEC data block (or codeword). The generator polynomial is also programmable. The last FEC codeword can be either fixed-length or shortened.

[0122] The FEC decoder 263 can be configured to have the descrambler located either before the deinterleaver 262 or after the RS decoder 272.

[0123] The data from the demodulator 257 and the equalizer 258 is utilized by a ranging block 259 in order to allow for different distances (ranges) to the transmitter. The wide-spread distance from head-end to each subscriber in a cable network introduces relatively large receive timing and power uncertainties for the receiver, which must be compensated for by means of a ranging process during initialization. A special ranging sequence with a long preamble in a ranging time slot is preferably reserved, as described below. The ranging block 259 estimates the receive timing and amplitude of the ranging sequence and passes the measurements to the MAC controller 206. The MAC controller 206 assembles the information and sends it back to the individual subscriber 108 via the downstream path 232 (see FIG. 6). The subscriber 108 can then adjust its own transmit timing and power level. Any large frequency offset in a transmitter is also measured and can be corrected during the ranging process.

[0124] A preamble processor 260 analyzes the preamble in each burst. The data from the preamble processor 260 is also utilized by the ranging block 259.

[0125] Tracking loops 261 also utilize the data from preamble processor 260.The operation of the digital tracking loops for carrier phase and symbol timing follows the initial preamble process. The tracking loops 261 further utilize the adaptive equalization and ingress cancellation module 258. Data is then forwarded to a forward error correction interface module 263.

[0126] The forward error correction 263 interface uses inputs from the descrambler 272 and the RS decoder 264. Output from the forward error correction interface 263 is used by the deinterleaver 262 and the MAC/PHY interface 265 for Receive Channel A 279.

[0127] Additional detail of this embodiment, particularly as it relates to the FFT aspect, may be found in commonly assigned U.S. patent application Ser. No. ______, filed on _______, entitled “RECEIVER HAVING INTEGRATED SPECTRAL ANALYSIS CAPABILITY”, which is incorporated herein by reference.

[0128] Generally, when channel impairments such as narrow-band interferers are present in the channel, a pre-filter, such as an adaptive notch filter may be present to cancel the interferers, as shown schematically in FIG. 7. However, the notch filter will create inter-symbol interference (ISI) to the rest of the burst demodulator. This distorts the received signal pattern and thus affects the fidelity of the correlation vector. In order to avoid this effect, the preamble is preferably also pre-distorted by convolving the preamble with the coefficients of the notch filter.

[0129] Generally, the effects of inter-symbol interference on the statistics relating to transmission channel errors are relatively minor, provided the delay spread of the channel is substantially shorter than a duration of one symbol. For higher symbol rates, the systems error rate performance usually deteriorates significantly.

[0130] Consider the situation shown in FIG. 8. In FIG. 8, a transmitter at the user end transmits packets with a certain preamble. The transmission passes through a square root raised cosine filter 1005, prior to being transmitted over the channel 210. Additive white noise normally is present in the system. At the receiver end, a square root raised cosine filter 1006 is used, before being fed into a preamble matched filter 520. The preamble matched filter 520 performs a correlation function of the received preamble and a local replica of the preamble. The recovered signal should be the exact preamble that was transmitted from the user end.

[0131] In practical systems, however, transmission systems frequently suffer from narrow band noise, sometimes referred to an ingress. As shown in the bottom diagram of FIG. 8, the transmitter transmits a preamble which first passes through the square root raised cosine filter 1005, before being transmitted down the channel 210. At the receive end, the square root raised cosine filter 520 is followed by a notch filter 515.

[0132] The signal then passes on to the preamble matched filter (PMF) 520, which performs a correlation between the received preamble and a local replica of the preamble. However, the local replica of the preamble needs to be predistorted by appropriate notch filter coefficients, i.e.:

New preamble=Preamble* (notch filter coefficients).

[0133] Note that the preamble preferably should be scaled (normalized), to insure proper operation of the correlation mechanism.

[0134] One embodiment of a burst receiver architecture adapted to robust burst detection as discussed above is shown schematically in FIG. 9. It includes a Start of Packet (SOP) detection, initial parameter estimation, and fine tuning using tracking loops and multi-pass processing on the preamble portion. Preamble correlation of a known sequence, such as a 16-symbol CAZAC sequence, is used as the basis of parameter estimation.

[0135]FIG. 9 shows the overall system block diagram of a robust burst receiver. Broadly speaking, the relevant portions of the burst receiver 202 may be thought of as including carrier frequency mixer 252, a filter 300, a preamble processor/ranging subsystem 302, and a tracking subsystem 355.

[0136] Note that the filter 300 in FIG. 9 corresponds to the variable decimators 353 and 354 and the matched filters 255, 256 of FIG. 6. The preamble processor/ranging subsystem 302 collectively corresponds to the Preamble Processor Block 260 and the Ranging Block 259 of FIG. 6.

[0137] As shown in FIG. 9, the filter 300 receives a signal from the analog front end 251 and the mixer 252. Typically, the filter 300 functions as a Nyquist-type filter, which outputs filtered samples to a preamble correlator 305, and a second mixer 335. The preamble correlator 305 correlates the preamble in the received burst with a locally stored replica of the preamble and outputs a correlation vector (CV).

[0138] The correlation vector of the received signal with the known sequence is sensitive to carrier frequency offset. To preserve a unique peak of the correlation vector (CV) in the presence of a large frequency offset, the differential correlation technique may also be utilized to indicate the SOP flag during ranging. The differential correlation refers to the correlation of the differentially detected signals. The current signal is multiplied by the complex conjugate of the previous signal at (for example) one symbol apart to produce a new signal. This differential signal is then correlated with the differential preamble signal. This operation turns a frequency offset into a phase offset, thus still producing a reliable peak of the correlation vector even with a large frequency offset. However, this operation results in a nominal 3 dB loss in the effective signal-to-noise ratio (SNR) of the preamble correlation at the receiver. Thus, this option can selectively be disabled when for example the symbol rate is high, which implies relatively small carrier frequency offset at a given system frequency offset between the transmitter and receiver.

[0139] To produce constant, preamble correlation peak value in view of different notch filter coefficients, the total power of the pre-distorted preamble pattern is normalized as shown in FIG. 8. A preamble correlation block diagram with all these techniques incorporated is shown in FIG. 10, as discussed in further detail below.

[0140] Carrier frequency is estimated in two steps. First, the phase of the differential correlation peak provides the coarse carrier frequency estimation. The coarse frequency error is compensated by derotating the buffered preamble as referred above. The error estimate is given by Δf=arg[CV(t_(p)) e^(jωis d)]. After that, fine carrier frequency can be estimated by comparing the phases of the two consecutive CV peaks as follows: ${\Delta \quad f} = {{\arg \left\lbrack {\sum\limits_{k = 1}^{P}{{P(k)} \cdot {P\left( {k + N} \right)}^{*}}} \right\rbrack}.}$

[0141] Note that this technique is insensitive to the ISI created by the channel. However, its estimation range is limited to F_(sym)/(2N), where N is the correlation vector length in symbols (e.g. a range of 3.125% of F_(sym) for N=16 symbols). Both a large offset range and very accurate estimates can be achieved by using both techniques in sequence.

[0142] Note also that in a typical low symbol rate transmission, which usually corresponds to a large frequency offset, differential correlation is used, since there is little ISI/ICF. For a high symbol rate, which corresponds to a small frequency offset and high intersymbol interference/narrow band interference, direct correlation (rather than differential correlation) of the preamble is used.

[0143] The peak value of the correlation vector provides an amplitude estimate of the received signal. However, the correlation peak value is sensitive to the residual error of the fine frequency estimation. By compensating by the residual frequency error, the gain estimation can be significantly improved as shown the table of FIG. 14 and described below. Furthermore, the initial gain estimation can be further improved by enabling the fine gain loop—such as equalizer tracking.

[0144]FIG. 10 shows additional detail of the preamble correlator 105. The digital signal from the filter 300 goes into a differential operator 503 that includes a delay element 505, a conjugation operator 504, and a multiplier 506. The local replica of the preamble is convolved with prefilter coefficients in a convolution operator 515. The result of the convolution operation is fed into a differential operator 516. A prescaler 540 normalizes the local replica of the preamble, outputting a normalized version of the local replica of the preamble. The normalized local replica of the preamble and the differentiated digital signal from the filter 300 are both input into a preamble matched filter 520, which outputs the vector CV corresponding to the convolution operation of the (differentiated) input signal and the normalized local replica of the preamble.

[0145] The output of the preamble matched filter 520 can be used to determine if a packet has been received, i.e. to generate the start of packet signal. In the case of ranging, the preamble correlator performs a correlation between a differentiated version of the preamble and a differentiated version of the locally stored replica of the preamble {d_(16} for N=)16. In the case of data packets containing a preamble and a data portion as shown in FIG. 1, the preamble correlator 305 will perform a correlation between a CAZAC sequence in the preamble, and a locally stored replica {c₁₆} of the CAZAC sequence.

[0146] Returning to FIG. 9, the preamble correlator 305 outputs a correlation vector (CV) to a Start Of Packet detector 310 and to a parameter estimator 320. If the Start Of Packet detector 310 detects that the packet is beginning by sensing a peak in the CV, it will output a Start of Packet flag to the parameter estimator 120.

[0147] The parameter estimator 320 is responsible for estimating the four parameters of primary importance: frequency, gain, phase, and symbol timing. Based on a peak of the correlation vector (CV) in the case of ranging, the parameter estimator will estimate a coarse carrier frequency based on a peak of the correlation vector from the preamble correlator 305. An example of a correlation vector CV is shown in FIG. 11, and an example of a differential correlation vector is shown in FIG. 12.

[0148] The parameter estimator 320 then outputs a coarse frequency estimate based on a differential CV peak to the second mixer 335. The second mixer 335 outputs phase adjusted samples, with coarse frequency error removed (i.e., with adjusted phase) to a buffer 330. The buffer 330 also stores the samples outputted by the mixer 335. The buffer 330 provides the phase adjusted samples to the parameter estimator 320 and to a multiplier 340.

[0149] During ranging, the parameter estimator 320 also performs a fine carrier frequency estimate, based on the second and third sequences. (An example of the second and third sequences is {d₁₆} {d₁₆}, as discussed above.) An example of a correlation vector for the entire ranging preamble is illustrated in FIG. 13. As may be seen in FIG. 13, the left-most peak corresponds to a peak of the correlation between a derivative of the first received sequence (which is an integral of a CAZAC sequence) and a locally stored replica of the CAZAC sequence. The next two peaks corresponds to correlations between derivatives of the second and third received sequences, and the locally stored replicas of the CAZAC sequence {c_(16} {c) ₁₆}. Based on the second and third peaks exceeding a predetermined threshold, the parameter estimator 320 performs a fine carrier frequency estimate. The fourth CAZAC sequence in the preamble may be used to perform a check, verifying that the fine carrier frequency estimate has been done correctly.

[0150] For ranging, (1) the first correlation vector (the differential CV) is greater than a predetermined threshold th₁ (e.g., 60 in FIG. 13), and (2) the peak-to-sidelobe ratio for the second CV is greater than a predetermined threshold th₂, and (3) there is a slope change from positive to negative (i.e., there is a defined peak for the second correlation vector CV, which is about 78 in FIG. 13), and (4) at NT seconds later, the peak-to-sidelobe ratio for the third CV is greater than a predetermined threshold th₃, and (5) there is a slope change from positive to negative (i.e., there is a defined peak for the third correlation vector CV, which is also about 78 in FIG. 13), then the peaks are confirmed, and the signal is acquired, otherwise, there is a reset. The peak to sidelobe ratio (PSR) is defined as:

[0151] CV (peak)/avg of CV (samples away from the peak)

[0152] and provides a relative SNR when gain is normalized (e.g., during ranging).

[0153] For packet acquisition, if CV(peak)>th₁, and PSR>th₂ and there is a slope change in the expected window, then there is burst acquisition, otherwise there is a reset.

[0154] The parameter estimator 320 outputs the estimated gain to the multiplier 340, which multiplies the output of the buffer 330 by the estimated gain from the parameter estimator 320, outputting it to a third mixer 350. The third mixer 350 also takes as an input the fine carrier frequency estimate and a phase estimate from the parameter estimator 320. After performing another phase adjustment, the third mixer 350 outputs the phase-adjusted signal to a resampler 370. The parameter estimator 320 also outputs a symbol timing estimate to a baud loop 360.

[0155] Still with regard to FIG. 9, the outputs of the third mixer 350 and the parameter estimator 320 go to a tracking subsystem 355. Collectively, the resampler 370 and the baud loop 360 comprise a symbol timing subsystem 357. The symbol timing subsystem 357 outputs re-timed symbol samples to an adaptive equalizer/carrier loop block 375 (see also element 258 in FIG. 6).

[0156] Specifically, the adaptive equalizer/carrier loop block 375 includes a feed forward equalizer 380, which receives the re-timed symbol samples from the resampler 370. The feed forward equalizer 380 then outputs the forward equalized samples to a fourth mixer 385. The fourth mixer 385 also takes as input the output of a phase lock loop (carrier loop) 390, and then outputs phase adjusted forward equalized samples to a decision feedback equalizer 392. The decision feedback equalizer 392 includes a summer 395, a decision block 395 and a feedback equalizer 393, as shown in FIG. 9. The output of the decision block 395 are the symbols representing data.

[0157] Note that the carrier loop 390 and the baud loop 357 of FIG. 9 correspond to the tracking loops 261 of FIG. 6.

[0158] With regard to FIG. 9, it will also be appreciated that certain applications may require additional phase adjustment. For example, in the case of satellite communication, frequency offsets are frequently very large. Thus, in such a system, prior to inputting the signal into the filter 300 of FIG. 9, the signal may pass through a first mixer, to remove a very large frequency offset often found in such satellite systems.

[0159] Additionally, as may be seen in FIG. 12, the differential correlation vector (CV) outputted by the preamble correlator 305 in the case of a coarse carrier frequency estimate does not always have a well defined peak. In that case, any number of methods may be used to estimate the peak. For example, in the embodiment, parabolic interpolation is used to interpolate the peak of the differential correlation vector, based on the highest three points in the vector, as shown in FIG. 12. One of ordinary skill in the art will appreciate that the invention is not limited to the parabolic interpolation method, but may use any number of techniques to estimate the location of the peak.

[0160] Additionally, the term “mixer” has been used in this context to refer to a multiplier by e^(jωt). This, of course, accomplishes a phase adjustment of the signal, without altering its amplitude. It will be appreciated, however, that other methods of adjusting phase exist, in addition to multiplying the signal by e^(jωt). For example, a CORDIC processor (coordinate rotation digital computer), which performs a trigonometric rotation by using shifts and adds, without any multiplies, may also be used to accomplish the same purpose. Thus, for purposes of this application, the term “mixer,” “derotator” and “phase adjuster” are used interchangeably, to refer to any mechanism for adjusting the phase of a signal.

[0161] It has been found empirically that certain combinations of CAZAC sequences provide superior results, particularly when cyclic continuations are included are added to the CAZAC sequence. For example, consider a CAZAC sequence of length 16, designated by {c₁₆}, which has the following symbols:

c₀, c₁, c₂ . . . c₁₅

[0162] It has been found experimentally that rather than using a “bare” CAZAC sequence as above, it is preferable to use a 20-symbol sequence as follows:

c₁₄, c₁₅, c₀, c₁, c₂ . . . c₁₅, c₀, c₁

[0163] Which may be written as c₁₄, c₁₅, {c₁₆}, c₀, c₁. The symbols C₁₄, C₁₅ in front of the CAZAC sequence are referred to as a “cyclic continuation,” with the inherent property that these symbols must correspond to a continuation of the CAZAC sequence (i.e., for a sequence {c₃₂}=c₀, c₁, c₂ . . . c₃₁, the cyclic continuation preceding the sequence {c₃₂} would be C₃₀, C₃₁, and the cyclic continuation following the sequence {c₃₂} is c₀, c₁). Note that the sequence of symbols

c₁₄, c₁₅, c₀, c₁, c₂ . . . c₁₅, c₀, c₁

[0164] does NOT have the CAZAC property, although it is derived from a CAZAC sequence as c₁₄, c₁₅, {c₁₆}, c₀, c₁ (i.e., a two-symbol cyclic continuation in front of the CAZAC sequence, and a two-symbol cyclic continuation after it). It will also be appreciated that the cyclic continuation need not be two symbols long.

[0165] One embodiment for ranging includes at least four sequences plus one cyclic continuation symbol as follows:

{d₁₇}{d₁₆}{d_(16}{d) ₁₆}

[0166] for a 65 symbol long ranging preamble. The sequence {d₁₇} is used for a coarse frequency estimate, the sequence {d₁₆} {d₁₆} is used for a fine frequency estimate, and the last sequence {d₁₆} is used to perform a check. (See FIG. 13).

[0167] In the case of preambles in bursts that contain a payload, other possible sequences are:

c₁₄, c₁₅, {c₁₆}, c₀, c₁(a 20 symbol sequence)

c₁₄, c₁₅,{c₁₆},{c₁₆}, c₀, c₁ (a 36 symbol sequence)

c₁₄, c₁₅, {c₁₆}, {c₁₆}, {c₁₆} (a 50 symbol sequence) etc. . . .

[0168] Which sequence to use in the preamble depends on the order of modulation desired, channel characteristics, etc.

[0169] It will also be appreciated that the signal-to-noise ratio (SNR) is determined during ranging. Additionally, if other modems are already operating on the channel, the burst receiver 202 may use information from the other modems to generate an initial estimate of the signal-to-noise ratio.

[0170] Additionally, one of the advantages of the present invention is that tracking may be performed continually, including during the data portion of the burst. In other words, although the parameter estimator 320 provides initial estimates that may be true during the preamble portion of the burst, an even better parameter estimate may be accomplished by continually tracking the data. This is accomplished in the decision feedback equalizer 392. Specifically, in one example, once the data portion of the burst is received, the feedback equalizer will gradually converge towards a set of equalizer coefficients (equalizer taps). If the initial gain estimate was too high, the main tap will decrease slightly, and if the initial gain estimate was too low, the main tap will increase slightly, to reflect an even better estimate of the gain required.

[0171] Additionally, other taps of the equalizer 392, in some cases all the taps of the equalizer 392, may be used to adjust the gain, depending on system parameters. For example, for satellite communications, typically only the main tap of the equalizer will be required, while for cable modem transmissions, more than just a main tap may be needed. Also, there are a number of mathematical functions that can take into account the energy in all the equalizer taps, for example, sum of squares.

[0172]FIG. 14 illustrates the concept of correcting the gain versus carrier frequency error. As the table of FIG. 14 illustrates, the parameter estimator 320 can look up the estimated correction factor based on the frequency error while it is tracking data, and adjust gain accordingly. The fine gain tracking may be performed on the entire payload of the burst, or on a subset of the payload.

[0173] It will be appreciated that the various inventions described herein and in U.S. Provisional Patent Application No. 60/296,450, filed on Jun. 8, 2001, entitled “ROBUST BURST DETECTION ACQUISITION SYSTEM AND METHOD,” U.S. Provisional Patent Application No. 60,296,455, filed on Jun. 8, 2001, entitled “RECEIVER HAVING INTEGRATED SPECTRAL ANALYSIS CAPABILITY,” and U.S. patent application Ser. No. 09/430,821, filed on Oct. 29, 1999, all of which are incorporated herein by reference, may be combined in various ways in a single system.

[0174] It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined in the appended claims. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents. 

What is claimed is:
 1. A method of parameter estimation in a shared channel communications system comprising the steps of: receiving a preamble comprising first, second and third sequences corresponding to sequences having zero autocorrelation; performing a coarse carrier frequency estimate based on the first sequence; and performing a fine carrier frequency estimate based on the second and third sequences.
 2. The method of claim 1, wherein a derivative of the first sequence is a CAZAC sequence.
 3. The method of claim 1, further including the step of differentiating the first sequence.
 4. The method of claim 1, wherein the first sequence is at least one symbol longer than the second sequence.
 5. The method of claim 1, further including the step of estimating channel SNR based on the preamble.
 6. The method of claim 1, further including the step of estimating carrier phase based on the preamble.
 7. The method of claim 1, further including the step of estimating gain based on the preamble.
 8. The method of claim 1, further including the step of estimating symbol timing based on the preamble.
 9. The method of claim 1, further including the step of estimating channel SNR based on estimates of channel SNR's of other users.
 10. The method of claim 1, further including the step of estimating channel SNR based on a spectral analysis of the preamble.
 11. The method of claim 1, wherein said step of performing the coarse frequency estimate utilizes a phase of a differential correlation peak of the first sequence.
 12. The method of claim 1, further including the step of derotating the first sequence prior to said step of performing the coarse frequency estimate.
 13. The method of claim 1, wherein said step of performing the fine carrier frequency estimate compares phases of two consecutive correlation vectors corresponding to the second and third sequences.
 14. The method of claim 1, wherein the preamble further comprises a fourth sequence identical to the third sequence.
 15. The method of claim 14, wherein said step of performing the fine carrier frequency estimate uses the second, third and fourth sequences.
 16. The method of claim 1, wherein at least some of the sequences correspond to QPSK sequences.
 17. The method of claim 1, wherein all the second and third sequences are 16 symbols long.
 18. The method of claim 1, wherein further including the step of gain correction based on the fine carrier frequency estimate.
 19. The method of claim 18, further including the step of looking up a correction factor in a table based on an error of the fine carrier frequency estimate.
 20. The method of claim 1, further including the steps of: receiving a burst that includes a burst preamble with a zero autocorrelation sequence and a payload portion, and continually tracking burst parameters during the payload portion of the burst.
 21. The method of claim 20, wherein the burst preamble includes two back-to-back zero autocorrelation sequences, and a first cyclic continuation that includes two symbols prior to the two back-to-back zero autocorrelation sequences, and a second cyclic continuation that includes two symbols after the two back-to-back zero autocorrelation sequences.
 22. The method of claim 20, wherein the burst preamble includes three back-to-back zero autocorrelation sequences, and a first cyclic continuation that includes two symbols prior to the two back-to-back zero autocorrelation sequences, and a second cyclic continuation that includes two symbols after the three back-to-back zero autocorrelation sequences.
 23. The method of claim 20, wherein the burst includes at least one additional zero autocorrelation sequence outside the burst preamble.
 24. The method of claim 20, further including the step of filtering the burst preamble using a pre-filter.
 25. A method of ranging in a shared channel communications system comprising the steps of: receiving a ranging preamble comprising a first near-CAZAC sequence followed by second and third sequences whose derivatives correspond to CAZAC sequences; performing a coarse carrier frequency estimate based on the first sequence; and performing a fine carrier frequency estimate based on the second and third sequences.
 26. The method of claim 25, further including the step of estimating channel SNR based on the ranging preamble.
 27. The method of claim 25, further including the step of estimating carrier phase based on the ranging preamble.
 28. The method of claim 25, further including the step of estimating gain based on the ranging preamble.
 29. The method of claim 25, further including the step of estimating symbol rate based on the ranging preamble.
 30. The method of claim 25, further including the step of estimating channel SNR based on estimates of channel SNR's of other users.
 31. The method of claim 25, further including the step of estimating channel SNR based on a spectral analysis of the ranging preamble.
 32. The method of claim 25, wherein said step of performing a coarse frequency estimate utilizes a phase of a differential correlation peak of the first sequence.
 33. The method of claim 25, further including the step of derotating the first sequence prior to said step of performing the coarse frequency estimate.
 34. The method of claim 25, wherein said step of performing a fine carrier frequency estimate compares phases of two consecutive correlation vectors corresponding to the second and third sequences.
 35. The method of claim 25, wherein the preamble further comprises a fourth sequence representing an integral of a CAZAC sequence.
 36. The method of claim 35, wherein said step of performing the fine carrier frequency estimate uses the second, third and fourth sequences.
 37. The method of claim 35, wherein derivatives of all the sequences are QPSK sequences.
 38. The method of claim 25, wherein the second and third sequences have the same length.
 39. The method of claim 25, wherein the second and third sequences are 16 symbols long.
 40. The method of claim 25, further including the step of gain correction based on the fine carrier frequency estimate.
 41. The method of claim 40, further including the step of looking up a correction factor in a table based on an error of the fine carrier frequency estimate.
 42. A method of tracking data in a shared channel communications system comprising the steps of: receiving a ranging preamble; performing a coarse carrier frequency estimate based on the ranging preamble; performing a fine carrier frequency estimate based on the ranging preamble; estimating gain based on the fine carrier frequency estimate; receiving a burst including a burst preamble and data; and correcting the gain based on tracking the data.
 43. The method of claim 42, wherein the ranging preamble includes a first sequence whose derivative is a CAZAC sequence, and second and third CAZAC sequences each corresponding to a truncated first sequence.
 44. The method of claim 42, further including the step of estimating channel SNR based on the ranging preamble.
 45. The method of claim 42, further including the step of estimating carrier phase based on the ranging preamble.
 46. The method of claim 42, further including the step of estimating symbol rate based on the ranging preamble.
 47. The method of claim 42, further including the step of estimating channel SNR based on estimates of channel SNR's of other users.
 48. The method of claim 42, further including the step of estimating channel SNR based on a spectral analysis of the ranging preamble.
 49. The method of claim 42, wherein said step of performing a coarse frequency estimate utilizes a phase of a differential correlation peak of the ranging preamble.
 50. The method of claim 42, wherein said step of performing the fine carrier frequency estimate compares phases of two consecutive correlation vectors corresponding to the second and third sequences.
 51. The method of claim 42, wherein the step of performing a fine carrier frequency estimate uses the second and third sequences.
 52. The method of claim 42, wherein the second and third sequences that are each 16 symbols long.
 53. The method of claim 42, wherein said step of gain correction uses the fine carrier frequency estimate.
 54. The method of claim 42, further including the step of pre-scaling a local replica of a zero autocorrelation sequence prior to correlating it with the ranging preamble.
 55. The method of claim 42, wherein said correcting step includes the step of looking up a correction factor in a table based on an error of the fine carrier frequency estimate.
 56. The method of claim 42, wherein the burst preamble includes a zero autocorrelation sequence and a first cyclic continuation corresponding to the zero autocorrelation sequence.
 57. The method of claim 56, further including a second cyclic continuation after the zero autocorrelation sequence.
 58. The method of claim 42, wherein the burst preamble includes two back-to-back zero autocorrelation sequences, and a first cyclic continuation that includes two symbols prior to the two back-to-back zero autocorrelation sequences, and a second cyclic continuation that includes two symbols after the two back-to-back zero autocorrelation sequences.
 59. The method of claim 42, wherein the burst preamble includes three back-to-back zero autocorrelation sequences, and a first cyclic continuation that includes two symbols prior to the two back-to-back zero autocorrelation sequences, and a second cyclic continuation that includes two symbols after the three back-to-back zero autocorrelation sequences.
 60. The method of claim 42, wherein said correcting step includes the step of continually tracking the burst during a data portion of the burst.
 61. The method of claim 42, wherein the burst includes at least one zero autocorrelation sequence outside the preamble.
 62. The method of claim 42, further including the step of filtering the burst using a pre-filter.
 63. The method of claim 42, further including the step of adjusting a gain based on a main equalizer tap during said correcting step.
 64. A method of receiving data in a shared channel communications system comprising the steps of: receiving a burst that includes a burst preamble and a payload; performing a carrier frequency estimate and a gain estimate based on the preamble; tracking the burst with an equalizer; adjusting the gain estimate based on at least a main tap coefficient of the equalizer, wherein the equalizer uses at least a portion of the payload to derive the main tap coefficient; and extracting symbols from the data.
 65. The method of claim 64, wherein, in said adjusting step, the equalizer uses an entire payload to derive the main tap coefficient.
 66. The method of claim 64, wherein, in said adjusting step, the gain estimate is adjusted based on a plurality of taps of the equalizer.
 67. The method of claim 64, wherein the burst preamble further includes a CAZAC sequence and a cyclic continuation before the CAZAC sequence.
 68. The method of claim 64, further including the step of estimating channel SNR based on the burst preamble.
 69. The method of claim 64, further including the step of estimating carrier phase based on the burst preamble.
 70. The method of claim 64, wherein said correcting step uses a lookup table to look up a correction factor based on a frequency error.
 71. The method of claim 64, wherein the burst preamble includes a CAZAC sequence and a cyclic continuation prior to the CAZAC sequence.
 72. The method of claim 71, wherein the burst preamble includes a second cyclic continuation after the CAZAC sequence.
 73. The method of claim 64, wherein the burst preamble includes two back-to-back zero autocorrelation sequences, and a first cyclic continuation that includes two symbols prior to the two back-to-back zero autocorrelation sequences, and a second cyclic continuation that includes two symbols after the two back-to-back zero autocorrelation sequences.
 74. The method of claim 64, wherein the burst preamble includes three back-to-back zero autocorrelation sequences, and a first cyclic continuation that includes two symbols prior to the two back-to-back zero autocorrelation sequences, and a second cyclic continuation that includes two symbols after the three back-to-back zero autocorrelation sequences.
 75. The method of claim 64, wherein the burst includes at least one additional CAZAC sequence outside the preamble.
 76. The method of claim 64, further including the step of filtering the burst using a pre-filter.
 77. The method of claim 64, further including the step of adjusting a gain based on a main equalizer tap coefficient during said extracting step.
 78. A method of extracting data from a burst in a shared channel communications system comprising the steps of: receiving a burst including a burst preamble and data, the burst preamble including a zero autocorrelation sequence and at least one cyclic continuation adjacent to the zero autocorrelation sequence; performing a carrier frequency estimate based on a correlation vector of the burst preamble and a local replica of the zero autocorrelation sequence; and extracting data from the burst based on the carrier frequency estimate.
 79. The method of claim 78, wherein the zero autocorrelation sequence is phase adjusted prior to said performing step.
 80. The method of claim 78, further including the step of gain correction based on the fine carrier frequency estimate.
 81. The method of claim 78, further including the step of looking up a correction factor in a table based on an error of the frequency estimate in said performing step.
 82. The method of claim 78, further including the step of pre-scaling the local replica.
 83. A system for ranging a receiver in a shared communications channel comprising: a filter that receives a signal from the shared communications channel, the signal including a ranging preamble that has a first sequence whose derivative is a zero autocorrelation sequence, and second and third sequences corresponding to a truncated first sequence, and outputs Nyquist samples; a preamble processor/ranging subsystem that receives the Nyquist samples from the filter, provides a coarse carrier frequency estimate based on the first sequence, and refines the coarse carrier frequency estimate based on the second and third sequences to provide a fine carrier frequency estimate; and a tracking subsystem that extracts data from the signal based on the fine carrier frequency estimate from the preamble processor/ranging system.
 84. The system of claim 83, wherein a derivative of the first sequence is a CAZAC sequence.
 85. The system of claim 83, wherein first and second symbols of the first sequence are the same.
 86. The system of claim 83, wherein the preamble processor/ranging subsystem estimates channel SNR based on the ranging preamble.
 87. The system of claim 83, wherein the preamble processor/ranging subsystem estimates carrier phase based on the ranging preamble.
 88. The system of claim 83, wherein the preamble processor/ranging subsystem estimates gain based on the ranging preamble.
 89. The system of claim 83, wherein the preamble processor/ranging subsystem estimates symbol rate based on the ranging preamble.
 90. The system of claim 83, wherein the preamble processor/ranging subsystem estimates the coarse carrier frequency using a phase of a differential correlation peak of the first sequence.
 91. The system of claim 83, wherein the preamble processor/ranging subsystem includes a first derotator, and wherein the filter outputs the Nyquist samples to the first derotator.
 92. The system of claim 91, wherein the preamble processor/ranging subsystem includes a preamble correlator that outputs a correlation vector of the preamble and a locally-stored copy of the preamble based on the Nyquist samples.
 93. The system of claim 92, wherein the preamble processor/ranging subsystem includes a start-of-packet detect block that uses the correlation vector as an input, and outputs a start-of-packet signal to a parameter estimator.
 94. The system of claim 93, wherein the parameter estimator outputs the coarse carrier frequency estimate to the first derotator.
 95. The system of claim 94, wherein the first derotator outputs the Nyquist samples with their coarse frequency offset removed to a buffer.
 96. The system of claim 95, further including a multiplier that multiplies an estimated gain from the parameter estimator by an output of the buffer to output their product to a second derotator.
 97. The system of claim 95, wherein the second derotator outputs phase-adjusted symbols to the tracking subsystem.
 98. The system of claim 93, wherein the parameter estimator outputs a symbol timing estimate to the tracking subsystem.
 99. The system of claim 93, wherein the parameter estimator outputs a phase estimate and a fine carrier frequency estimate to a second derotator.
 100. The system of claim 99, wherein the tracking subsystem includes a resampler, the signal from the second derotator being inputted into the resampler.
 101. The system of claim 100, wherein the tracking subsystem includes a baud loop, the symbol timing estimate from the parameter estimator being input into the baud loop, and the output of the baud loop being inputted into the resampler.
 102. The system of claim 100, wherein the tracking subsystem includes an adaptive equalizer/carrier loop block, the resampler outputting re-timed samples to the adaptive equalizer/carrier loop block.
 103. The system of claim 102, wherein the adaptive equalizer/carrier loop block includes a feed-forward equalizer that converts re-timed symbols into forward-equalized samples.
 104. The system of claim 103, wherein the tracking subsystem adjusts a gain of the data based on a main equalizer tap of the feed-forward equalizer.
 105. The system of claim 104, further including a third derotator that adjusts a phase of the forward-equalized samples.
 106. The system of claim 105, wherein the adaptive equalizer/carrier loop block includes a decision feedback equalizer that converts phase adjusted forward-equalized samples into symbols.
 107. The system of claim 83, wherein the preamble processor/ranging subsystem compares phases of two consecutive correlation vectors corresponding to the second and third zero autocorrelation sequences to generate the fine carrier frequency estimate.
 108. The system of claim 83, wherein the preamble further includes a fourth sequence identical to the third sequence.
 109. The system of claim 108, wherein the step of performing a fine carrier frequency estimate uses the second, third and fourth sequences.
 110. The system of claim 83, wherein the tracking subsystem corrects gain based on the fine carrier frequency estimate.
 111. The system of claim 83, wherein a local replica of the first zero autocorrelation sequence is prescaled for a convolution with the ranging preamble by the preamble processor ranging system.
 112. The system of claim 83, wherein the tracking subsystem looks up a correction factor in a table based on an error of the fine carrier frequency estimate.
 113. The system of claim 83, wherein the ranging preamble includes at least one cyclic continuation prior to the first sequence.
 114. The system of claim 83, wherein, when the system receives a burst including a preamble and the payload, the tracking subsystem continually tracks the burst during the payload.
 115. The system of claim 114, wherein the burst includes at least one zero autocorrelation sequence outside the burst preamble.
 116. The system of claim 83, wherein the filter includes a pre-filter.
 117. A system for receiving communications over a shared communications channel comprising: a filter that receives a digital signal from the shared communications channel and outputs a sampled signal; a preamble correlator that correlates the sampled signal with a local replica of a preamble to generate a correlation vector and a Start of Packet signal; a parameter estimator that receives the correlation vector and the Start of Packet signal from the preamble correlator and outputs a coarse frequency estimate, an estimated gain, an estimated carrier phase and a symbol timing estimate; a first derotator that receives the sampled signal from the filter and outputs a first derogated signal; a buffer that receives the first derotated signal and outputs a buffered first derogated signal to the parameter estimator; a second derotator that receives the buffered first derotated signal multiplied by the estimated gain, and outputs a second derogated signal; a symbol timing subsystem that receives the timing estimate and the second derotated signal and outputs timed symbol samples; a feed forward equalizer that receives the timed symbol samples and outputs forward equalized samples; a tracking loop, including a third derotator, that receives forward equalized samples and outputs phase adjusted symbol samples whose phase is adjusted by the third derotator; and a decision feedback equalizer that receives the phase adjusted symbol samples and outputs equalized samples.
 118. The system of claim 117, wherein a derivative of the sampled signal includes a zero autocorrelation sequence.
 119. The system of claim 117, wherein the zero autocorrelation sequence is a CAZAC sequence.
 120. The system of claim 117, wherein the decision feedback equalizer adjusts a gain of the data based on a main equalizer tap of the feed forward equalizer.
 121. The system of claim 117, wherein the parameter estimator subsystem compares phases of two consecutive correlation vectors corresponding to zero autocorrelation sequences to generate the fine carrier frequency estimate.
 122. A system for parameter estimation in a shared channel communications system comprising: means for receiving a preamble comprising a first sequence corresponding to a sequence having zero autocorrelation, and second and third sequences corresponding to a truncated first sequence; means for performing a coarse carrier frequency estimate based on the first sequence; and means for performing a fine carrier frequency estimate based on the second and third sequences.
 123. The system of claim 122, further including means for differentiating the first sequence.
 124. The system of claim 122, further including means for estimating channel SNR based on the preamble.
 125. The system of claim 122, further including means for estimating carrier phase based on the preamble.
 126. The system of claim 122, further including means for estimating gain based on the preamble.
 127. The system of claim 122, further including means for estimating symbol timing based on the preamble.
 128. The system of claim 122, further including means for estimating channel SNR based on estimates of channel SNR's of other users.
 129. The system of claim 122, further including means for estimating channel SNR based on a spectral analysis of the preamble.
 130. The system of claim 122, wherein said step of performing the coarse frequency estimate utilizes a phase of a differential correlation peak of the first sequence.
 131. The system of claim 122, further including means for derotating the first sequence prior to said step of performing the coarse frequency estimate.
 132. The system of claim 122, further including means for comparing phases of two consecutive correlation vectors corresponding to the second and third sequences.
 133. The system of claim 122, wherein further including means for gain correction based on the fine carrier frequency estimate.
 134. The system of claim 122, further including means for looking up a correction factor in a table based on an error of the fine carrier frequency estimate.
 135. The system of claim 122, further including; means for receiving a burst that includes a burst preamble and a data portion, and means for continually tracking burst parameters during a data portion of the burst.
 136. A system for ranging in a shared channel communications system comprising the steps of: means for receiving a ranging preamble comprising a first sequence whose derivative is a zero autocorrelation sequence followed by the second and third sequences that each correspond to an integral of a zero autocorrelation sequence; means for performing a coarse carrier frequency estimate based on the derivative of the first sequence; means for performing a fine carrier frequency estimate based on derivatives of the second and third sequences.
 137. The system of claim 136, further including means for estimating channel SNR based on the ranging preamble.
 138. The system of claim 136, further including means for estimating carrier phase based on the ranging preamble.
 139. The system of claim 136, further including means for estimating gain based on the ranging preamble.
 140. The system of claim 136, further including means for estimating symbol rate based on the ranging preamble.
 141. The system of claim 136, further including means for estimating channel SNR based on estimates of channel SNR's of other users.
 142. The system of claim 136, further including means for estimating channel SNR based on a spectral analysis of the ranging preamble.
 143. The system of claim 136, further including means for derotating the first sequence prior to said step of performing the coarse frequency estimate.
 144. The system of claim 136, further including means for comparing phases of two consecutive correlation vectors corresponding to the second and third sequences.
 145. The system of claim 136, further including means for gain correction based on the fine carrier frequency estimate.
 146. The system of claim 136, further including means for looking up a correction factor in a table based on an error of the fine carrier frequency estimate. 